k -Protected vertices in binary search trees
نویسندگان
چکیده
منابع مشابه
k-PROTECTED VERTICES IN BINARY SEARCH TREES
We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k− 1 from the closest leaf converges to a rational constant ck as n goes to infinity.
متن کاملk-Protected Vertices in Unlabeled Rooted Plane Trees
We find a simple, closed formula for the proportion of vertices which are k -protected in all unlabeled rooted plane trees on n vertices. We also find that, as n goes to infinity, the average rank of a random vertex in a tree of size n approaches 0.727649, and the average rank of the root of a tree of size n approaches 1.62297. Mathematics Subject Classification 05A15 · 05A16 · 05C05 tree, enum...
متن کاملRandomized K-Dimensional Binary Search Trees
This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a variant of K-dimensional binary trees. This data structure allows the ee-cient maintenance of multidimensional records for any sequence of insertions and deletions ; and thus, is fully dynamic. We show that several types of associative queries are eeciently supported by randomized Kd-trees. In particular...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملProtected points in k-ary trees
Following [1], in this note we compute the average number of protected points in all k-ary trees with n internal points.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2014
ISSN: 0196-8858
DOI: 10.1016/j.aam.2013.09.003